Polynomial Vicinity Circuits and Nonlinear Lower Bounds
نویسنده
چکیده
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial in t of some degree k. We prove that such circuits require size Ω(n/ log n) to compute several natural families of functions, including sorting, finite field arithmetic, and the “rigid linear transformations” of Valiant [26]. Our proof develops a “separator theorem” in the style of Lipton and Tarjan [14] for a new class of graphs, and our methods may have independent graph-theoretic interest.
منابع مشابه
Lower Bounds for Approximations by Low Degree Polynomials Over Zm
We use a Ramsey-theoretic argument to obtain the first lower bounds for approximations over Zm by nonlinear polynomials: A degree-2 polynomial over Zm (m odd) must differ from the parity function on at least a 1=2 1=2(logn) (1) fraction of all points in the Boolean n-cube. A degree-O(1) polynomial over Zm (m odd) must differ from the parity function on at least a 1=2 o(1) fraction of all points...
متن کاملLower Bounds for Uniform Constant Depth Circuits by Vivek Kashinath Gore
OF THE DISSERTATION Lower Bounds for Uniform Constant Depth Circuits by Vivek Kashinath Gore, Ph.D. Dissertation Director: Professor Eric Allender Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A big advantage of studying Boolean circuits is that they can be viewed as simple combinatorial objects and thus allow us to use many algebraic and com...
متن کاملThe Partial Derivative method in Arithmetic Circuit Complexity
In this thesis we survey the technique of analyzing the partial derivatives of a polynomial to prove lower bounds for restricted classes of arithmetic circuits. The technique is also useful in designing algorithms for learning arithmetic circuits and we study the application of the method of partial derivatives in this setting. We also look at polynomial identity testing and survey an e cient a...
متن کاملOn Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant
We consider the problem of fixed-polynomial lower bounds on the size of arithmetic circuits computing uniform families of polynomials. Assuming the generalised Riemann hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in MA having no arithmetic circuits of size O(n) over C (allowing any complex constant). We also build a family of polynomials that can be evalua...
متن کاملSome Lower Bound Results for Set-Multilinear Arithmetic Computations
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to show lower bound results. Some of our results extend existing lower bounds, while others are new and raise open questions. Specifically, our main results are t...
متن کامل